A Parallel Quasi-Newton Method for Optimization Problems with Equality Constraints
نویسندگان
چکیده
منابع مشابه
Least-change quasi-Newton updates for equality-constrained optimization
January 28, 2000 Abstract. This paper investigates quasi-Newton updates for equality-constrained optimization. Using a least-change argument we derive a class of rank-3 updates to approximations of the one-sided projection of the Hessian of the Lagrangian which keeps the appropriate part symmetric (and possibly positive definite). By imposing the usual assumptions we are able to prove 1-step su...
متن کاملQuasi-Newton Methods for Nonconvex Constrained Multiobjective Optimization
Here, a quasi-Newton algorithm for constrained multiobjective optimization is proposed. Under suitable assumptions, global convergence of the algorithm is established.
متن کاملQuasi-Newton acceleration for equality-constrained minimization
Optimality (or KKT) systems arise as primal-dual stationarity conditions for constrained optimization problems. Under suitable constraint qualifications, local minimizers satisfy KKT equations but, unfortunately, many other stationary points (including, perhaps, maximizers) may solve these nonlinear systems too. For this reason, nonlinear-programming solvers make strong use of the minimization ...
متن کاملA Parallel Quasi-Newton Method for Gaussian Data Fitting
We describe a parallel method for unconstrained optimization based on the quasi-Newton descent method of Broyden, Fletcher, Goldfarb, and Shanno. Our algorithm is suitable for both single-instruction and multiple-instruction parallel architectures and has only linear memory requirements in the number of parameters used to ®t the data. We also present the results of numerical testing on both sin...
متن کاملAn inexact Newton method for nonconvex equality constrained optimization
We present a matrix-free line search algorithm for large-scale equality constrained optimization that allows for inexact step computations. For strictly convex problems, the method reduces to the inexact sequential quadratic programming approach proposed by Byrd et al. [SIAM J. Optim. 19(1) 351–369, 2008]. For nonconvex problems, the methodology developed in this paper allows for the presence o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the Society of Instrument and Control Engineers
سال: 1989
ISSN: 0453-4654
DOI: 10.9746/sicetr1965.25.1347